Integer programming models for detecting graph bipartitions with structural requirements
نویسندگان
چکیده
منابع مشابه
Integer programming models and algorithms for the graph decontamination problem with mobile agents
This paper considers the problem of using synchronous mobile agents to decontaminate the nodes of a graph given a spreading contamination. We begin by considering the problem of minimizing cleaning time, given initial agent and contamination locations. Then, we take as input a set of all possible locations in which a contamination can start, and examine problems in which we strategically pre-po...
متن کاملAlgorithms for Stochastic Mixed-Integer Programming Models
In this chapter, we will study algorithms for both two-stage as well as multi-stage stochastic mixed-integer programs. We present stagewise (resourcedirective) decomposition methods for two-stage models, and scenario (pricedirective) decomposition methods for multi-stage models. The manner in which these models are decomposed relies not only on the specific data elements that are random, but al...
متن کاملInteger Linear Programming Models for Constrained Clustering
We address the problem of building a clustering as a subset of a (possibly large) set of candidate clusters under user-defined constraints. In contrast to most approaches to constrained clustering, we do not constrain the way observations can be grouped into clusters, but the way candidate clusters can be combined into suitable clusterings. The constraints may concern the type of clustering (e....
متن کاملInteger programming models for flat origami
This paper describes an integer programming model for a special class of flat foldable origami and shows how to use it to test foldability of crease patterns, as well as to find folds that satisfy some given properties, for example color pattern requirements when duo paper is used. To represent a crease pattern within this model, all its crease lines must be segments of a square grid or 45-degr...
متن کاملLogic Integer Programming Models for Signaling Networks
We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2017
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21786